Deductive synthesis of the unification algorithm
نویسندگان
چکیده
منابع مشابه
comparison of catalytic activity of heteropoly compounds in the synthesis of bis(indolyl)alkanes.
heteropoly acids (hpa) and their salts have advantages as catalysts which make them both economically and environmentally attractive, strong br?nsted acidity, exhibiting fast reversible multi-electron redox transformations under rather mild conditions, very high solubility in polar solvents, fairly high thermal stability in the solid states, and efficient oxidizing ability, so that they are imp...
15 صفحه اولOn the Unification of Active Databases and Deductive databases
These two rule-oriented paradigms of databases have been the focus of extensive research and are now coming of age in the commercial DBMS world. However, the systems developed so far support well only one of the two paradigms— thus limiting the effectiveness of such systems in many applications that require complete integration of both kinds of rules. In this paper, we discuss the technical pro...
متن کاملUnification of Bounded Simple Set Terms in Deductive Databases
In this paper we consider the problem of uniication of bounded simple set terms in the eld of deductive databases. Simple set terms are of the form fe 1 ; : : : ; e n g, where e i is a constant or a variable and are much used in deductive database systems such as LDL and Coral. In this paper we consider a restricted form of uniication, called \weak uniication", which is mainly used in the eld o...
متن کاملAn Integration of Deductive Retrieval into Deductive Synthesis
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of correct programs. In this paper, we describe an integration of both methods which combines their complementary benefits and alleviates some of their drawbacks. The core of our integration is an algorithm which automat...
متن کاملFundamentals of Deductive Program Synthesis
An informal tutorial is presented for program synthesis, with an emphasis on deductive methods. According to this approach, to construct a program meeting a given specification, we prove the existence of an object meeting the specified conditions. The proof is restricted to be sufficiently constructive, in the sense that, in establishing the existence of the desired output, the proof is forced ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1981
ISSN: 0167-6423
DOI: 10.1016/0167-6423(81)90004-6